1825C - LuoTianyi and the Show - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long

void mayTheForceBeWithYou(){
    int p, seats;
    cin >> p >> seats;
    vector<int> a(p);
    int countl = 0;
    int countr = 0;
    set<int> x;
    for(int i = 0; i<p; i++){
        cin >> a[i];
        if(a[i] == -1) countl++;
        else if(a[i] == -2) countr++;
        else x.insert(a[i]);
    }
    int s = x.size();   
    int j = 0;
    //ignore one type
    int ans = min(seats, max(countl + s, countr + s));
    //element number j is the pivot point = p
    for (int p : x) {
        int lf = min(countl + j, p - 1), rf = min(seats - p + 1, countr + s - j);
        ans = max(ans, lf + rf);
        j++;
    }     
    cout << ans;

}
 
int main()
{
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   int ts = 1;
   cin>>ts;
   while (ts--){
       mayTheForceBeWithYou();
       cout<<endl;
   }
}